Use-Me Sort: A New Sorting Algorithm
نویسندگان
چکیده
منابع مشابه
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In this note, a simple natural phenomenon is used to design a sorting algorithm for positive integers, called here Bead–Sort. The algorithm’s run– time complexity ranges from O(1) to O(S) (S is the sum of the input integ...
متن کاملBinar Sort: A Linear Generalized Sorting Algorithm
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting ...
متن کاملMatrix Sort - A Parallelizable Sorting Algorithm
Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements. The arrangement can be in ascending or descending order based on the requirement given. Time complexity, space complexity and optimality are used to assess the algorithms. In this paper, a new sorting algorithm called Matrix sort is introduced. This algorithm aims to sort the eleme...
متن کاملK-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!
Sundararajan and Chakraborty [10] introduced a new version of Quick sort removing the interchanges. Khreisat [1] found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of ...
متن کاملSmart Sort: a Fast, Efficient and Robust Sorting Algorithm
Smart Sort algorithm is a “smart” fusion of heap construction procedures (of Heap sort algorithm) into the conventional “Partition” function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2014
ISSN: 2249-0868
DOI: 10.5120/ijais14-451228